منابع مشابه
Uncovered bargaining solutions
An uncovered bargaining solution is a bargaining solution for which there exists a complete and strict relation (tournament) such that, for each feasible set, the bargaining solution set coincides with the uncovered set of the tournament. We provide a characterization of a class of uncovered bargaining solutions. J.E.L. codes: C72, D44.
متن کاملTwo-stage Bargaining Solutions
We introduce and characterize a new class of bargaining solutions: those which can be obtained by sequentially applying two binary relations to eliminate alternatives. As a by-product we obtain as a particular case a partial characterization result by Zhou (Econometrica, 1997) of an extension of the Nash axioms and solution to domains including non-convex problems, as well as a complete charact...
متن کاملOrdinal Solutions to Bargaining Problems
A solution to bargaining problems is ordinal when it is covariant with order-preserving transformations of utility. Shapley (1969) has shown that there exists no ordinal, efficient, and symmetric solution to twoplayer bargaining problems, and has constructed such a solution to threeplayer problems. Here, Shapley’s solution is extended in two directions. First, it is shown how to construct an in...
متن کاملThe Properly Efficient Bargaining Solutions
This note is motivated by the similarity between multiobjective programming (MOP) and bargaining theory. It uses the known MOP concepts to establish two new bargaining results: (1) the efficiency of KalaiSmorodinsky (KS) and Nash (NA) solutions for large classes of bargaining problems can be refined to the sharper concept of proper efficiency; (2) the independence of irrelevant alternatives (II...
متن کاملPure Strategy Nash Bargaining Solutions
A broad class of 2-person threat games for which a unique pure strategy Nash bargaining solution exists is characterized in terms of three, simple, empirically meaningful restrictions on the joint objective function: compact domain, continuity, and "corner concavity." Connectedness [in particular, convexity] of the strategy and payoff sets is not required. In addition, conditions are given for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Game Theory
سال: 2009
ISSN: 0020-7276,1432-1270
DOI: 10.1007/s00182-009-0172-7